Uniform simplicity of groups with proximal action
نویسندگان
چکیده
منابع مشابه
Uniform symplicity of groups with proximal action
We prove that groups acting boundedly and order-primitively on linear orders or acting extremly proximality on a Cantor set (the class including various Higman-Thomson groups and Neretin groups of almost automorphisms of regular trees, also called groups of spheromorphisms) are uniformly simple. Explicit bounds are provided.
متن کاملOn the Uniform Simplicity of Diffeomorphism Groups
We show the uniform simplicity of the identity component Diff(M)0 of the group of Cr diffeomorphisms Diff (Mn) (1 ≤ r ≤ ∞, r = n+1) of the compact connected n-dimensional manifold Mn with handle decomposition without handles of the middle index n/2. More precisely, for any elements f and g of such Diff(M)0 \{id}, f can be written as a product of at most 16n+28 conjugates of g or g−1, which we d...
متن کاملSimplicity of some automorphism groups
a r t i c l e i n f o a b s t r a c t Let M be a countably infinite first order relational structure which is homogeneous in the sense of Fraïssé. We show, under the assumption that the class of finite substructures of M has the free amalgamation property, along with the assumption that Aut(M) is transitive on M but not equal to Sym(M), that Aut(M) is a simple group. This generalises results of...
متن کاملSimplicity of Certain Groups of Diffeomorphisms
D. Epstein has shown [1] that for quite general groups of homeomorphisms, the commutator subgroup is simple. In particular, let M be a manifold. (In this note, we assume all manifolds are finite dimensional, Hausdorff, class C, and have a countable basis for their topology.) By a C r + mapping (resp. diffeomorphism) we mean a C mapping (resp. diffeomorphism) whose rth derivative is Lipschitz. L...
متن کاملRecognising simplicity of black-box groups
We investigate the complexity of computing involutions and their centralizers in groups of Lie type over finite fields of odd order, and discuss applications to the problem of deciding whether a matrix group, or a black-box group of known characteristic, is simple. We show that if the characteristic is odd, then simplicity can be recognised in Monte Carlo polynomial time. Mathematics Subject Cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society, Series B
سال: 2017
ISSN: 2330-0000
DOI: 10.1090/btran/18